Hybrid LP/SDP Bounding Procedure
نویسندگان
چکیده
The principal idea of this paper is to exploit Semidefinite Programming (SDP) relaxation within the framework provided by Mixed Integer Nonlinear Programming (MINLP) solvers when tackling Binary Quadratic Problems (BQP). SDP relaxation is well-known to provide strong bounds for BQP in practice. However, the method is not typically implemented in many state-of-the-art MINLP solvers based on Linear Programming (LP) relaxation. This paper demonstrates that this idea could be computationally useful. The Quadratic Stable Set Problem (QSSP) is adopted as the case study. The tests indicate that the Hybrid LP/SDP Bounding Procedure allows a noticeable reduction of computing time and a cut of almost one order of magnitude for the branching nodes. Furthermore, we propose and test a new linearization technique which outperforms the standard one for many classes of QSSP instances.
منابع مشابه
Ellipsoidal Bounds for Static Response of Uncertain Trusses by Using Semidefinite Programming
A semidefinite relaxation technique is proposed for computing a minimal bounding ellipsoid that contains the set of static responses of an uncertain truss. We assume that the parameters both of member stiffnesses and external forces are unknown but bounded. By using a combination of the quadratic embedding technique of the uncertainty and the S-procedure, we formulate a semidefinite programming...
متن کاملForeword: for Special Issue on Semide nite Programming
Semideenite programming (denoted SDP) is an extension of linear programming (LP), with vector variables replaced by matrix variables and nonnegativity elementwise replaced by positive semideeniteness. Let us express a (primal) SDP as min C X s.t. AX = b X 0; where: C; X are in S n , the space of symmetric n n matrices; the inner product C X = trace CX; denotes nonnegativity in the LL owner part...
متن کاملAll plasma products are not created equal: Characterizing differences between plasma products.
BACKGROUND Plasma can be manufactured by multiple methods. Few studies have compared quality parameters between plasma products that may affect efficacy and safety. METHODS Four different plasma products were analyzed to include fresh frozen plasma (FFP), liquid plasma (LP), solvent detergent plasma (SDP), and a spray-dried, solvent detergent-treated plasma (SD-SDP) at multiple time points of...
متن کاملThe Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based relaxations with LP relaxations for MAX2SAT. We will show how SDP relaxations are surprisingly powerful, providing much tighter bounds than LP relaxations, across different constrainedness regions. SDP relaxations can...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Semidefinite Programming for Uncertain Linear Equations in Static Analysis of Structures
This paper presents a method for computing a minimal bounding ellipsoid that contains the solution set to the uncertain linear equations. Particularly, we aim at finding a bounding ellipsoid for static response of structures, where both external forces and elastic moduli of members are assumed to be imprecisely known and bounded. By using the Slemma, we formulate a semidefinite programming (SDP...
متن کامل